def path_length(start, end, size):
if end >= start:
return end - start
else:
return size + end - start
n, m = map(int, input().split())
a = list(map(int, input().split()))
counter = 0
start = 1
for i in range(m):
counter += path_length(start, a[i], n)
start = a[i]
print(counter)#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int a=1,d,n,m,s=0;
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>d;
if(a<d){
s=s+abs(d-a);
a=d;
}
if(a>d){
s=s+((n+d)-a);
a=d;
}
}
cout<<s;
}49A - Sleuth | 1541A - Pretty Permutations |
1632C - Strange Test | 673A - Bear and Game |
276A - Lunch Rush | 1205A - Almost Equal |
1020B - Badge | 1353A - Most Unstable Array |
770A - New Password | 1646B - Quality vs Quantity |
80A - Panoramix's Prediction | 1354B - Ternary String |
122B - Lucky Substring | 266B - Queue at the School |
1490A - Dense Array | 1650B - DIV + MOD |
1549B - Gregor and the Pawn Game | 553A - Kyoya and Colored Balls |
1364A - XXXXX | 1499B - Binary Removals |
1569C - Jury Meeting | 108A - Palindromic Times |
46A - Ball Game | 114A - Cifera |
776A - A Serial Killer | 25B - Phone numbers |
1633C - Kill the Monster | 1611A - Make Even |
1030B - Vasya and Cornfield | 1631A - Min Max Swap |